Non-linear Extended Binary Sequence with Low Cross-Correlation
نویسندگان
چکیده
منابع مشابه
Diophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملOn the Linear Span of a Binary Sequence Family with Optimal Correlation Properties
Sequences are critical for anti-jamming and security in spread spectrum communications networks. The complexity to break sequence is measured by linear span of sequence. The linear span of a sequence is the lowest degree of the characteristic polynomials that can generate the sequence. A new family of sequences with optimal correlation properties is constructed for the generalized Kasami set. A...
متن کاملExtended Linear Formulation for Binary Quadratic Problems
We propose and test a new linearisation technique for the Binary Quadratic Problems (BQPs). We computationally prove that the new formulation, called Extended Linear Formulation, can be effective for different classes of problems in practice. Our tests are based on two sets of classical BQPs from the literature, i.e., the Unconstrained BQP and the Maximum Cut of edge-weighted graphs. Finally we...
متن کاملExtended Binary Linear Codes from Legendre Sequences
A construction based on Legendre sequences is presented for a doubly-extended binary linear code of length 2p + 2 and dimension p+1. This code has a double circulant structure. For p = 4k +3, we obtain a doubly-even self-dual code. Another construction is given for a class of triply extended rate 1/3 codes of length 3p + 3 and dimension p + 1. For p = 4k + 1, these codes are doubly-even selfort...
متن کاملNew Binary Sequences of Period pq with Low Values of Correlation and Large Linear Complexity
Many new binary sequences are obtained from Jacobi sequences with arbitrary starting points and investigated from the cryptographic viewpoint. Autocorrelation values of these new sequences and cross-correlation values between of them are calculated. The results show that these values may be very low and distributed flatly under certain conditions. Linear complexity of them can be proved always ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korean Institute of Information and Communication Engineering
سال: 2012
ISSN: 2234-4772
DOI: 10.6109/jkiice.2012.16.4.730